#include <iostream>
using namespace std;

int partition(int arr[],int low,int high) {
    int mid = arr[low];
    while (low < high) {
        while (low < high && mid <= arr[high])
            high--;
        arr[low] = arr[high];
        while (low < high && mid >= arr[low])
            low++;
        arr[high] = arr[low];
    }
    arr[low] = mid;
    return low;
}

void quickSort(int arr[],int low, int high) {

    if (low < high) {
        int mid = partition(arr,low,high);
        quickSort(arr,low,mid-1);
        quickSort(arr,mid+1,high);
    }
}
int main() {

    int s1[5] = {11,13,15,17,19};
    int s2[5] = {2,4,6,8,20};
    int s[10] = {11,13,15,17,19,2,4,6,8,20};
    quickSort(s,0,10);
    cout<<s[10/2];
    std::cout << "Hello, World!" << std::endl;
    return 0;
}
